Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules
نویسندگان
چکیده
1 Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain [email protected] and Institute of Mathematics and Computer Science Academy of Sciences of Moldova Str. Academiei 5, Chişinău, MD 2028, Moldova [email protected] 2 Faculty of Informatics, Vienna University of Technology Favoritenstr. 9–11, A–1040 Vienna, Austria {rudi,marion}@emcc.at
منابع مشابه
Tissue P Systems with Symport/Antiport Rules of One Symbol Are Computationally complete
We consider tissue P systems using symport/ antiport rules of only one symbol where in each link (channel) between two cells at most one rule is applied, but in each channel a symport/ antiport rule has to be used if possible. We prove that any recursively enumerable set of k-dimensional vectors of natural numbers can be generated (accepted) by such a tissue P system with symport/ antiport rule...
متن کاملSmall Universal Tissue P Systems with Symport/Antiport Rules
In this note, we consider the problem of looking for small universal one-symbol tissue P systems with symport/antiport rules. It is proved that six cells suffice to generate any recursively enumerable set of natural numbers by such a onesymbol tissue P system with symport/antiport rules, under the restriction that only one channel is allowed between two cells or between a cell and the environme...
متن کاملMinimal Cooperation in Symport/Antiport P Systems with One Membrane
In this paper we consider symport/antiport P systems with one membrane and rules having at most two objects. Although it has been proved that only finite number sets can be generated by both OP1(sym2) (one-membrane systems with symport rules of weight at most 2) and OP1(sym1, anti1) (one-membrane systems with symport/antiport rules of weight 1), the exact characterization is still an open quest...
متن کاملP Systems with Symport/Antiport of Rules
Moving “instructions” instead of “data” using transport mechanisms inspired by biology is the basic idea of the computing device presented in this paper. Specifically, we propose a new class of P systems that use both evolution rules and symport/antiport rules. The idea of this kind of systems is the following: during a computation, symbol-objects (the “data”) evolve using evolution rules, but ...
متن کاملNumber of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness
Proton pumping P systems are a variant of membrane systems with both rewriting rules and symport/antiport rules, where a set of objects called protons is distinguished, every cooperative symport or antiport rule involves a proton, but no rewriting rule does. Time-freeness property means the result of all computations does not depend on the time it takes to execute the rules. The goal of this ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005